Partition and Conquer
نویسندگان
چکیده
Although maps and partitions are ubiquitous in geographical information systems and spatial databases, there is only little work investigating their foundations. We give a rigorous definition for spatial partitions and propose partitions as a generic spatial data type that can be used to model arbitrary maps and to support spatial analysis. We identify a set of three powerful operations on partitions and show that the type of partitions is closed under them. These basic operators are sufficient to express all known application-specific operations. Moreover, many map operations will be considerably generalized in our framework. We also indicate that partitions can be effectively used as a meta-model to describe other spatial data types.
منابع مشابه
Theories and Uses of Context in Knowledge Representation and Reasoning
This paper discusses the uses of context in knowledge representation and reasoning (KRR). We propose to partition the theories of context brought forward in KRR into two main classes, which we call divide-and-conquer and compose-and-conquer. We argue that this partition provides a possible explanation of why in KRR context is used to solve different types of problems, or to address the same pro...
متن کاملDivide and conquer partitioning techniques for smart water networks
Inserting remote control valves in a water distribution system allows the implementation of the “divide and conquer” paradigm that consists in dividing a large network into smaller subsystems, also called water network partitioning (WNP), for applying water balance, pressure control and water quality protection. Some heuristic procedures, based on different techniques (graph theory, clustering,...
متن کاملDivide and Conquer: A New Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
Bondeli, S_, Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations, Parallel Comput ing 17 (1991) 419-434_ We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel computers. The algorithm is flexible, permits multiprocessing or a combinat ion of vector and multipro...
متن کاملFree Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملOptimum Partition Parameter of Divide-and-Conquer Algorithm for Solving Closest-Pair Problem
Divide and Conquer is a well known algorithmic procedure for solving many kinds of problem. In this procedure, the problem is partitioned into two parts until the problem is trivially solvable. Finding the distance of the closest pair is an interesting topic in computer science. With divide and conquer algorithm we can solve closest pair problem. Here also the problem is partitioned into two pa...
متن کاملA Divide and Conquer Framework for Distributed Graph Clustering
Graph clustering is about identifying clusters of closely connected nodes, and is a fundamental technique of data analysis with many applications including community detection, VLSI network partitioning, collaborative filtering, etc. In order to improve the scalability of existing graph clustering algorithms, we propose a novel divide and conquer framework for graph clustering, and establish th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997